Finding Solvable Priority Schemes for Decoupled Path Planning Techniques for Teams of Mobile Robots
نویسندگان
چکیده
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and prioritized, thereby avoiding combinatorially hard planning problems typically faced by centralized approaches. In this paper we present a method for finding solvable priority schemes for such prioritized and decoupled planning techniques. Existing approaches apply a single priority scheme which makes them overly prone to failure in cases where valid solutions exist. By searching in the space of priorization schemes, our approach overcomes this limitation. To focus the search, our algorithm is guided by constraints generated from the task specification. To illustrate the appropriateness of this approach, this paper discusses experimental results obtained with real robots and through systematic robot simulation. The experimental results demonstrate that our approach can successfully solve many more coordination problems than previous decoupled and prioritized techniques.
منابع مشابه
Exploiting constraints during prioritized path planning for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and prioritized, thereby avoiding combinatorially hard planning problems typically faced by centralized approaches. In this paper we present a method for finding solvable priority schemes for such prioritized and decoupled pl...
متن کاملFinding and Optimizing Solvable Priority Schemes for Decoupled Path Planning Techniques for Teams of Mobile Robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and prioritized, thereby avoiding combinatorially hard planning problems typically faced by centralized approaches. While these methods are very efficient, they have two major drawbacks. First, they are incomplete, i.e. they ...
متن کاملConstraint-Based Optimization of Priority Schemes for Decoupled Path Planning Techniques
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and prioritized, thereby avoiding combinatorially hard planning problems typically faced by centralized approaches. While these methods are very efficient, they have two major drawbacks. First, they are incomplete, i.e. they ...
متن کاملMobile Robot Navigation in Dynamic Environments
Service robots which act in environments populated by humans have become very popular in the last few years. A variety of systems exists which act for example in hospitals, office buildings, department stores, and museums. Furthermore, several multi-robot systems have been developed for tasks which can be accomplished more efficiently by a whole team of robots than just by a single robot. These...
متن کاملOptimizing Schedules for Prioritized Path Planning of Multi-Robot Systems
The coordination of the motions of the robots is one of the fundamental problems for multi-robot systems. A popular approach to avoid planning in the high-dimensional composite configuration space are prioritized and decoupled techniques. While these methods are very efficient, they have two major drawbacks. First, they are incomplete, i.e. they sometimes fail to find a solution even if one exi...
متن کامل